Parallelizing Nested Loops with Approximations of Distance Vectors: A Survey
نویسندگان
چکیده
Received (received date) Revised (revised date) Communicated by (Name of Editor) ABSTRACT In this paper, we compare three nested loops parallelization algorithms (Allen and Kennedy's algorithm, Wolf and Lam's algorithm and Darte and Vivien's algorithm) that use diierent representations of distance vectors as input. We study the optimality of each with respect to the dependence analysis it uses. We propose well-chosen examples that illustrate the power and limitations of the three algorithms. This study identiies which algorithm is the most suitable for a given representation of distance vectors.
منابع مشابه
Compile Time Partitioning of Nested Loop Iteration Spaces with Non-uniform Dependences*
In this paper we address the problem of partitioning nested loops with non-uniform (irregular) dependence vectors. Parallelizing and partitioning of nested loops requires efficient inter-iteration dependence analysis. Although many methods exist for nested loop partitioning, most of these perform poorly when parallelizing nested loops with irregular dependences. Unlike the case of nested loops ...
متن کاملMinimum dependence distance tiling of nested loops with non-uniform dependences
In this paper we address the problem of partitioning nested loops with non-uniform (irregular) dependence vectors. Although many methods exist for nested loop partitioning, most of these perform poorly when parallelizing nested loops with irregular dependences. We apply the results of classical convex theory and principles of linear programming to iteration spaces and show the correspondence be...
متن کاملDependence Testing for Parallelizing Compilers ECE 1754 Survey Paper Student : Franjo Plavec Toronto , May 2003
Dependence testing is an important aspect of a parallelizing compiler. Precise data dependence information is necessary to detect parallelism. Main source of the parallelism in programs are loops. Dependence testing discovers data dependences between iterations of nested loops. In this paper we present the dependence testing problem, terminology and concepts used in dependence testing. We prese...
متن کاملTiling and Scheduling of Three-level Perfectly Nested Loops with Dependencies on Heterogeneous Systems
Nested loops are one of the most time-consuming parts and the largest sources of parallelism in many scientific applications. In this paper, we address the problem of 3-dimensional tiling and scheduling of three-level perfectly nested loops with dependencies on heterogeneous systems. To exploit the parallelism, we tile and schedule nested loops with dependencies by awareness of computational po...
متن کاملExtracting data flow information for parallelizing FORTRAN nested loop kernels
Thesis Abstract Currently available parallelizing FORTRAN compilers expend a large amount of eeort in determining data independent statements in a program such that these statements can be scheduled in parallel without need for synchronisation. This thesis hypothesises that it is just as important to derive exact data ow information about the data dependencies where they exist. We focus on the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Parallel Processing Letters
دوره 7 شماره
صفحات -
تاریخ انتشار 1997